The Non-equivalent Circulant D-Optimal Designs for n=2 mod 4, n<=54, n=66
نویسندگان
چکیده
All non-equivalent circulant D-optimal designs for n ~-2 mod 4, n ~< 54 and n = 66 are given and were found by an exhaustive search. There is a unique non-equivalent circulant design for each value of n ~< 18, 3 for n = 26 and n = 30, 8 for n = 38, 31 for n = 42, 17 for n = 46, 39 for n = 50, 48 for n = 54, and 1025 for n = 66. These are presented in tables in the form of the corresponding non-equivalent supplementary difference sets. Most of the given designs are new.
منابع مشابه
New D-optimal designs via cyclotomy and generalised cyclotomy
D-optimal designs are n x n ±l-matrices where n == 2 mod 4 with maximum determinant. D-optimal designs obtained via circulant matrices are equivalent to 2-{ v; kl i k2 i k1 + k2 ~(v 1)} supplementary difference sets, where v = ~. We use cyclotomy to construct D-optimal designs, where v is a prime. We give a generalisation of cyclotomy and extend the cyclotomic techniques which enables use to fi...
متن کاملThe Existence of Selfcomplementary Circulant Graphs
Let G be a finite , simple , undirected graph . The graph G is selfcompletementary if G is isomorphic to its complement G # ; in symbols , G . G # . It is well known that a selfcomplementary graph of order n exists if f n ; 0 or 1 (mod 4) . Moreover , a regular selfcomplementary graph of order n exists if f n ; 1 (mod 4) . The objective of this paper is to study selfcomplementary graphs with ev...
متن کاملA multi-dimensional block-circulant perfect array construction
We present a N-dimensional generalization of the two-dimensional block-circulant perfect array construction by [Blake, 2013]. As in [Blake, 2013], the families of N-dimensional arrays possess pairwise good zero correlation zone (ZCZ) cross-correlation. Both constructions use a perfect autocorre-lation sequence with the array orthogonality property (AOP). This paper presents a generalization of ...
متن کاملThe Metric Dimension of Circulant Graphs and Their Cartesian Products
Let G = (V,E) be a connected graph (or hypergraph) and let d(x, y) denote the distance between vertices x, y ∈ V (G). A subset W ⊆ V (G) is called a resolving set for G if for every pair of distinct vertices x, y ∈ V (G), there is w ∈ W such that d(x,w) 6= d(y, w). The minimum cardinality of a resolving set for G is called the metric dimension of G, denoted by β(G). The circulant graph Cn(1, 2,...
متن کاملThe metric dimension of circulant graphs and Cayley hypergraphs
Let G = (V,E) be a connected graph (or hypergraph) and let d(x, y) denote the distance between vertices x, y ∈ V (G). A subset W ⊆ V (G) is called a resolving set for G if for every pair of distinct vertices x, y ∈ V (G), there is w ∈ W such that d(x,w) 6= d(y, w). The minimum cardinality of a resolving set for G is called the metric dimension of G, denoted by β(G). In this paper we determine t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 65 شماره
صفحات -
تاریخ انتشار 1994